Aggregate Functions in Categorical Data Skyline Search (CDSS) for Multi-keyword Document Search
نویسندگان
چکیده
Literature review is the first step in starting research for a deep understanding of interest. However, finding literature relevant to interests difficult and takes time. Skyline query method that can be used filtering. An object p said dominate q if equals on all its attributes, at least better than one attribute. Categorical Data Search (CDSS) an algorithm filter skyline objects categorical data types such as documents. CDSS uses Extended Distance Wu Palmer (DEWP) calculate distance between user document keywords. The keywords queries are represented nodes ACM CCS ontology, documents assumed by single keyword. This study aims use search more keyword adding aggregate function (average, minimum, maximum) algorithm, especially calculating DEWP. thesis from IPB University computer science department. Document will extracted using Term Frequency-Inverse Frequency (TF-IDF) method. collected mapped mixed ontology tree refers Association Computing Machinery Classification System 2012 (ACM 2012) Computer Science Ontology (CSO) standards science. determining Block Nested Loop (BNL). evaluation ratio each CDSS. Based value, maximum DEWP has most results compared average minimum
منابع مشابه
Group-by and Aggregate Functions in XML Keyword Search
In this paper, we study how to support group-by and aggregate functions in XML keyword search. It goes beyond the simple keyword query, and raises several challenges including: (1) how to address the keyword ambiguity problem when interpreting a keyword query; (2) how to identify duplicated objects and relationships in order to guarantee the correctness of the results of aggregation functions; ...
متن کاملInvolving Aggregate Functions in Multi-relational Search
The fact that data is scattered over many tables causes many problems in the practice of data mining. To deal with this problem, one either constructs a single table by propositionalisation, or uses a Multi-Relational Data Mining algorithm. In either case, one has to deal with the non-determinacy of one-to-many relationships. In propositionalisation, aggregate functions have already proven to b...
متن کاملRelevant Answers for XML Keyword Search: A Skyline Approach
Identifying relevant results is a key task in XML keyword search (XKS). Although many approaches have been proposed for this task, effectively identifying results for XKS is still an open problem. In this paper, we propose a novel approach for identifying relevant results for XKS by adopting the concept of Mutual Information and skyline semantics. Specifically, we introduce a measurement to eff...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملEfficient Encrypted Keyword Search for Multi-user Data Sharing
In this paper, we provide a secure and e cient encrypted keyword search scheme for multi-user data sharing. Specifically, a data owner outsources a set of encrypted files to an untrusted server, shares it with a set of users, and a user is allowed to search keywords in a subset of files that he is authorized to access. In the proposed scheme, (a) each user has a constant size secret key, (b) ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Khazanah informatika
سال: 2023
ISSN: ['2621-038X', '2477-698X']
DOI: https://doi.org/10.23917/khif.v9i1.18127